adjacent vertex
英 [əˈdʒeɪsnt ˈvɜːteks]
美 [əˈdʒeɪsnt ˈvɜːrteks]
网络 邻接顶点; 邻接点
双语例句
- On Some Adjacent Vertex-distinguishing Edge Total Coloring of Double Graphs
关于若干倍图的邻点可区别边全染色 - Two Upper Bound of the Adjacent Strong Edge Coloring and the Adjacent Vertex Distinguishing Total Coloring of General Mycielski-Graphs
广义Mycielski图的邻强边色数和邻点可区别全色数的两个上界 - The adjacent vertex distinguishing total chromatic number is obtained for the flower graph.
得到了花图的邻点可区别全色数。 - Recently, many kinds of coloring problems are presented, such as the vertex distinguishing edge coloring and adjacent vertex distinguishing coloring are all the extension of coloring theory.
近几年来，各类染色问题也被相继提出，图的点可区别染色问题以及邻点可区别染色问题是图的染色理论中的一种推广。 - The adjacent vertex distinguishing total chromatic number is obtained for the middle graphs of path, cycle, star and fan graph.
本文考虑了图的中间图的邻点可区别全色数，并确定了路、圈、星图和扇图的中间图的邻点可区别全色数。 - Adjacent vertex distinguishing total coloring on 2-connected outer plane graph
2-连通外平面图的邻点可区别全染色 - On the Adjacent Vertex Distinguishing Total Coloring of 1-Tree
1-树图的邻点可区别全染色 - A set S of vertices of G is a total dominating set if every vertex of G is adjacent to some vertex in S.
G的顶点集的一个子集S是一个全控制集，如果G的每个顶点都相邻于S中的某个顶点。 - The loop direction is judged through the vector product of the adjacent two edges on the vertex with maximum coordinate value.
通过计算环的最大坐标值点处相邻两条边的切矢的叉积来判断环的方向。 - Strong distinguishable full-coloring at adjacent vertex of P_n × P_m
Pn×Pm的邻点强可区别的全染色 - On Adjacent Vertex-distinguishing Edge Chromatic Number of C_m · F_n
Cm·Fn的邻点可区别边色数 - Adjacent Vertex Distinguishing Total Coloring on the Flower Graph
花图F（r.m.n）的邻点可区别全染色 - A set S of vertices in a graph G is a dominating set ( total dominating set) of G if each vertex of V ( G)-S ( V ( G)) is adjacent to some vertex of S ( other than itself).
图G的点集S如果满足：VG-S（或VG）中每个点相邻于S中的某个点（或而不是它本身），则称点集S是一个控制集（或全控制集）。 - This algorithm removes vertices of the mesh according to the curvature of the vertex weighted by the area of the triangles which are adjacent to that vertex.
对于网格模型简化问题，本文提出了一种基于网格顶点曲率加权该顶点邻接三角形面积的顶点删除简化算法。 - Adjacent Vertex Distinguishing Total Coloring on the Product Graph P_2 × C_6
积图P2×C6的邻点可区别全染色 - The paper also discussed removing one of the control vertex of control polyhedron and the adjacent domain of the removing vertex was not considered again, so that the algorithm was reformed to be one of the unclosed surface modeling.
并讨论了在放开或删除一个控制点后，不再生成该控制点邻域内的所有曲面片，从而开放闭多面体的边界，将闭曲面造型算法延伸为开曲面造型的算法； - A cycle C of a graph G is called a dominating cycle if every vertex of G is adjacent to one vertex of C at least.
圈C称为图G的支配圈，若对G中任一点v，至少有圈C上的一个顶点与之邻接。 - Based on the idea of statistics on the struc-ture, the clique histogram represents the distribution of one vertex with respect to its adjacent vertices, which can capture statistical information on the vertex level.
采用对结构进行统计的思路，首先定义团直方图来表示图的顶点到其邻接顶点之间的分布，捕捉顶点层次上的统计信息。